Heuristic Algorithm for Min-max Vehicle Routing Problems

In order to satisfy with the individual and various demand of customer, the present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, new tabu search algorithm is used to get the optimization solution. It applies newly improved insertion method to construct initial solution, to improve the feasibility of the solution; centers the longest route to design dual layered random operation to construct its neighborhood, to realize the strategy of optimizing between and within the route, to boost the efficiency and quality of the searching. Applies auto adaptive tabu length to control the searching capability dynamically; At last, it uses simulated experiments to prove the effectiveness and feasibility of this algorithm, and provides clues for massively solving practical problems.